Optimal Discovery Strategies in White Space Networks

The whitespace-discovery problem describes two parties, Alice and Bob, trying to discovery one another and establish communication over one of a given large segment of communication channels. Subsets of the channels are occupied in each of the local environments surrounding Alice and Bob, as well as in the global environment (Eve). In the absence of a common clock for the two parties, the goal is to devise time-invariant (stationary) strategies minimizing the discovery time. We model the problem as follows. There are N channels, each of which is open (unoccupied) with probability p1, p2, q independently for Alice, Bob and Eve respectively. Further assume that N 1/(p1p2q) to allow for sufficiently many open channels. Both Alice and Bob can detect which channels are locally open and every time-slot each of them chooses one such channel for an attempted discovery. One aims for strategies that, with high probability over the environments, guarantee a shortest possible expected discovery time depending only on the pi’s and q. Here we provide a stationary strategy for Alice and Bob with a guaranteed expected discovery time of O(1/(p1p2q )) given that each party also has knowledge of p1, p2, q. When the parties are oblivious of these probabilities, analogous strategies incur a cost of a poly-log factor, i.e. Õ(1/(p1p2q )). Furthermore, this performance guarantee is essentially optimal as we show that any stationary strategies of Alice and Bob have an expected discovery time of at least Ω(1/(p1p2q )). ? This work was done during a visit to the Theory Group of Microsoft Research, Redmond.